NoN-Greedy Routing Algorithms Are Optimal or Know thy Neighbor’s Neighbor

نویسندگان

  • Moni Naor
  • Udi Wieder
چکیده

Greedy routing is a common approach when a graph has some underlying metric. We present an approach for designing routing algorithms called NoN-Greedy (Neighbor-of-Neighbor). We show that in two settings it reduces significantly the number of hops taken before the destination is reached and can yield degree optimal routing (in a network of degree O(log n) this means O(log / log logn) hops). In particular we consider the skip-graph peer-to-peer network and the small world settings and show that both models indeed permit degree optimal routing. The theoretic results are backed by simulations which show a significant improvement. While not being Greedy per-se, the NoN-Greedy algorithm preserves some good properties of greedy algorithms. Furthermore we show a lower bound proving that in order to reduce the number of hops, information regarding neighbors only is insufficient, thus the NoN approach is essential.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Know thy Neighbor’s Neighbor: the Power of Lookahead in Small Worlds and Randomized P2P Networks∗†

Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world networks. In each of these networks, a node has out-degree O(log n), where n denotes the total number of nodes, and greedy routing is known to take O(log n) hops on average. Our contribu...

متن کامل

Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds

We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routing in skip graphs and small worlds. Furthermore we show that a simple variation of Chord is degree optimal. Our algorithm is implemented on top of the conventional greedy algorithms, thus it maintains the good propertie...

متن کامل

Greedy Perimeter Stateless Routing In Vehicular Ad-Hoc Networks

Greedy Perimeter Stateless Routing (GPSR) is a Position-Based Routing Protocol for Wireless Networks that uses the Position of routers. GPSR makes greedy forwarding decision by using closest neighbor’s information of destination. In GPSR each node has the knowledge of its current physical position and also the neighbor node, this knowledge about node provides better routing. When a packet reach...

متن کامل

Power-aware semi-beaconless 3D georouting algorithms using adjustable transmission ranges for wireless ad hoc and sensor networks

Due to the limited lifetime of the nodes in ad hoc network, energy efficiency needs to be an important design consideration in any routing algorithm for ad hoc and sensor networks. In most of the existing position-based routing algorithms the nodes use the maximum transmission power to discover neighbors, which may cause excessive power consumption. This paper presents several localized power-a...

متن کامل

The Power of Lookahead in Small-World Routing Networks

Topologies and routing protocols for peer-to-peer networks have witnessed a flurry of research activity recently. Almost all designs employ greedy routing in one form or the other. Randomized topologies that are currently under investigation fall into two categories: (a) small-world network topologies based upon Kleinberg’s construction [Kle00], and (b) randomized variants of deterministic topo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003